منابع مشابه
Algorithms for Multi-criteria One-Sided Boundary Labeling
We present new algorithms for labeling a set P of n points in the plane with labels that are aligned to the left of the bounding box of P . The points are connected to their labels by curves (leaders) that consist of two segments: a horizontal segment, and a second segment at a fixed angle with the first. Our algorithm finds a collection of nonintersecting leaders that minimizes the total numbe...
متن کاملTwo-Sided Boundary Labeling with Adjacent Sides
In the Boundary Labeling problem, we are given a set of n points, referred to as sites, inside an axisparallel rectangle R, and a set of n pairwise disjoint rectangular labels that are attached to R from the outside. The task is to connect the sites to the labels by non-intersecting polygonal paths, so-called leaders. In this paper, we study the Two-Sided Boundary Labeling with Adjacent Sides p...
متن کاملMulti-stack Boundary Labeling Problems
The boundary labeling problem was recently introduced in [5] as a response to the problem of labeling dense point sets with large labels. In boundary labeling, we are given a rectangle R which encloses a set of n sites. Each site is associated with an axis-parallel rectangular label. The main task is to place the labels in distinct positions on the boundary of R, so that they do not overlap, an...
متن کاملAlgorithms for Multi-Criteria Boundary Labeling
We present new algorithms for labeling a set P of n points in the plane with labels that are aligned to one side of the bounding box of P . The points are connected to their labels by curves (leaders) that consist of two segments: a horizontal segment, and a second segment at a fixed angle with the first. Our algorithms find a collection of crossing-free leaders that minimizes the total number ...
متن کاملOn Multi-Stack Boundary Labeling Problems∗
Boundary labeling is a relatively new labeling method. It targets the areas of technical drawings and medical maps, where it is often common to explain certain parts of the drawing with large text labels arranged on its boundary, so that other parts of the drawing are not obscured. According to this labeling method, we are given a rectangle R, which encloses a set of n sites. Each site si is as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2015
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-015-0028-4